Randomized testing of distributed systems with probabilistic guarantees

Testing Probabilistic Distributed Systems

There has been much interest in the testing of systems that have physically distributed interfaces and this has been encouraged by recent trends towards the use of such systems. Most formal work in this area has considered the testing of deterministic systems based on deterministic models. However, distributed systems are usually nondeterministic and often can be seen as probabilistic systems i...

Quantitative Analysis of Randomized Distributed Systems and Probabilistic Automata

Flexible Information Discovery with Guarantees in Decentralized Distributed Systems

OF THE DISSERTATION Flexible Information Discovery with Guarantees in Decentralized Distributed Systems by CRISTINA SIMONA SCHMIDT Dissertation Director: Professor Manish Parashar Recent years have seen increasing interest in Peer-to-Peer (P2P) information sharing environments. The P2P computing paradigm enables entities at the edges of the network to directly interact as equals (or peers) and ...

Testing of Symbolic-Probabilistic Systems

We consider the testing of systems where probabilistic information is not given by means of fixed values but as sets of probabilities. We will use an extension of finite state machine where choices among transitions having the same input actions are probabilistically resolved. We will introduce our notion of test and we will define how tests are applied to the implementation under test (IUT). W...

Top-k Query Evaluation with Probabilistic Guarantees

Martin Theobald, Gerhard Weikum, Ralf Schenkel Max-Planck Institute of Computer Science D-66123 Saarbruecken, Germany {mtb, weikum, schenkel}@mpi-sb.mpg.de Abstract Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algorithm for evaluating top-k queries is Fagin’s thresho...